The size Ramsey number of a complete bipartite graph
نویسندگان
چکیده
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملThe Size-ramsey Number
The size-Ramsey number of a graph G is the smallest number of edges in a graph Γ with the Ramsey property for G, that is, with the property that any colouring of the edges of Γ with two colours (say) contains a monochromatic copy of G. The study of size-Ramsey numbers was proposed by Erdős, Faudree, Rousseau, and Schelp in 1978, when they investigated the size-Ramsey number of certain classes o...
متن کاملThe Size Ramsey Number
Let i2 denote the class of all graphs G which satisfy G-(Gl, GE). As a way of measuring r inimality for members of P, we define the Size Ramsey number ; We then investigate various questions concerned with the asymptotic behaviour of r .
متن کاملThe vertex size-Ramsey number
In this paper, we study an analogue of size-Ramsey numbers for vertex colorings. For a given number of colors r and a graph G the vertex size-Ramsey number of G, denoted by R̂v(G, r), is the least number of edges in a graph H with the property that any r-coloring of the vertices of H yields a monochromatic copy of G. We observe that Ωr(∆n) = R̂v(G, r) = Or(n ) for any G of order n and maximum deg...
متن کاملSome Ramsey numbers for complete bipartite graphs
Upper bounds are determined for the Ramsey number ](m,n), 2 :; m n. These bounds are attained for infinitely many n in case of m 3 and are fairly close to the exact value for every m if n is sufficiently large.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1993
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90521-t